De novo motif discovery facilitates identification of interactions between transcription factors in Saccharomyces cerevisiae

نویسندگان

  • Mei-Ju May Chen
  • Lih-Ching Chou
  • Tsung-Ting Hsieh
  • Ding-Dar Lee
  • Kai-Wei Liu
  • Chi-Yuan Yu
  • Yen-Jen Oyang
  • Huai-Kuang Tsai
  • Chien-Yu Chen
چکیده

MOTIVATION Gene regulation involves complicated mechanisms such as cooperativity between a set of transcription factors (TFs). Previous studies have used target genes shared by two TFs as a clue to infer TF-TF interactions. However, this task remains challenging because the target genes with low binding affinity are frequently omitted by experimental data, especially when a single strict threshold is employed. This article aims at improving the accuracy of inferring TF-TF interactions by incorporating motif discovery as a fundamental step when detecting overlapping targets of TFs based on ChIP-chip data. RESULTS The proposed method, simTFBS, outperforms three naïve methods that adopt fixed thresholds when inferring TF-TF interactions based on ChIP-chip data. In addition, simTFBS is compared with two advanced methods and demonstrates its advantages in predicting TF-TF interactions. By comparing simTFBS with predictions based on the set of available annotated yeast TF binding motifs, we demonstrate that the good performance of simTFBS is indeed coming from the additional motifs found by the proposed procedures. SUPPLEMENTARY INFORMATION Supplementary data are available at Bioinformatics online.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

De-Novo Learning of Genome-Scale Regulatory Networks in S. cerevisiae

De-novo reverse-engineering of genome-scale regulatory networks is a fundamental problem of biological and translational research. One of the major obstacles in developing and evaluating approaches for de-novo gene network reconstruction is the absence of high-quality genome-scale gold-standard networks of direct regulatory interactions. To establish a foundation for assessing the accuracy of d...

متن کامل

Purification of Saccharomyces cerevisiae eIF4E/eIF4G/Pab1p Complex with Capped mRNA

Protein synthesis is one of the most complex cellular processes, involving numerous translation components that interact in multiple sequential steps. The most complex stage in protein synthesis is the initiation process. The basal set of factors required for translation initiation has been determined, and biochemical, genetic, and structural studies are now beginning to reveal details of their...

متن کامل

Motif discovery and transcription factor binding sites before and after the next-generation sequencing era

Motif discovery has been one of the most widely studied problems in bioinformatics ever since genomic and protein sequences have been available. In particular, its application to the de novo prediction of putative over-represented transcription factor binding sites in nucleotide sequences has been, and still is, one of the most challenging flavors of the problem. Recently, novel experimental te...

متن کامل

WebMOTIFS: automated discovery, filtering and scoring of DNA sequence motifs using multiple programs and Bayesian approaches

WebMOTIFS provides a web interface that facilitates the discovery and analysis of DNA-sequence motifs. Several studies have shown that the accuracy of motif discovery can be significantly improved by using multiple de novo motif discovery programs and using randomized control calculations to identify the most significant motifs or by using Bayesian approaches. WebMOTIFS makes it easy to apply t...

متن کامل

SPACER: identification of cis-regulatory elements with non-contiguous critical residues

MOTIVATION Many transcription factors bind to sites that are long and loosely related to each other. De novo identification of such motifs is computationally challenging. In this article, we propose a novel semi-greedy algorithm over the space of all IUPAC degenerate strings to identify the most over-represented highly degenerate motifs. RESULTS We present an implementation of this algorithm,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Bioinformatics

دوره 28 5  شماره 

صفحات  -

تاریخ انتشار 2012